A polynomial algorithm for continuous non-binary disjunctive CSPs: extended DLRs
نویسندگان
چکیده
Nowadays, many real problems can be modelled as Constraint Satisfaction Problems (CSPs). Some CSPs are considered non-binary disjunctive CSPs. Many researchers study the problems of deciding consistency for Disjunctive Linear Relations (DLRs). In this paper, we propose a new class of constraints called Extended DLRs consisting of disjunctions of linear inequalities, linear disequations and non-linear disequations. This new class of constraints extends the class of DLRs. We propose a heuristic algorithm called DPOLYSA that solves Extended DLRs, as a non-binary disjunctive CSP solver. This proposal works on a polyhedron whose vertices are also polyhedra that represent the non-disjunctive problems. We also present a statistical preprocessing step which translates the disjunctive problem into a non-disjunctive and ordered one in each step.
منابع مشابه
A Polynomial Algorithm for Continuous Non-binary Disjunctive CSPs
Nowadays, many real problems can be modelled as Constraint Satisfaction Problems (CSPs). Some CSPs are considered nonbinary disjunctive CSPs. Many researchers study the problems of deciding consistency for Disjunctive Linear Relations (DLRs). In this paper, we propose a new class of constraints called Extended DLRs consisting of disjunctions of linear inequalities, linear disequations and non-l...
متن کاملA Linear-Programming Approach to Temporal Reasoning
We present a new formalism, Horn Disjunctive Linear Relations (Horn DLRs), for reasoning about temporal constraints. We prove that deciding satissabil-ity of sets of Horn DLRs is polynomial by exhibiting an algorithm based upon linear programming. Furthermore , we prove that most other approaches to tractable temporal constraint reasoning can be encoded as Horn DLRs, including the ORD-Horn alge...
متن کاملDisjunction of Non-binary and Numeric Constraint Satisfaction Problems
Nowadays, many researchers are working on Constraint Satisfaction Problems (CSPs). Many CSPs can be modelled as non-binary CSPs and, theoretically, they can be transformed into an equivalent binary CSP, using some of the current techniques. However, this transformation may be an inadequate or inefficient way to manage certain types of non-binary constraints. In this paper, we propose an algorit...
متن کاملA Unified Approach for Design of Lp Polynomial Algorithms
By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...
متن کاملGlobal Consistency for Continuous Constraints
This paper provides a technique for solving general constraint satisfaction problems (CSPs) with continuous variables. Constraints are represented by a hierarchical binary decomposition of the space of feasible values. We propose algorithms for pathand higher degrees of consistency based on logical operations defined on this representation and demonstrate that the algorithms terminate in polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Knowl.-Based Syst.
دوره 16 شماره
صفحات -
تاریخ انتشار 2003